‘KNOWABLE’ AS ‘KNOWN AFTER AN ANNOUNCEMENT’
نویسندگان
چکیده
منابع مشابه
'Knowable' as 'known after an announcement'
Public announcement logic is an extension of multi-agent epistemic logic with dynamic operators to model the informational consequences of announcements to the entire group of agents. We propose an extension of public announcement logic with a dynamic modal operator that expresses what is true after any announcement: ♦φ expresses that there is a truthful announcement ψ after which φ is true. Th...
متن کاملIRIT / RR – 2008 - 2 – FR ‘ Knowable ’ as ‘ known after an announcement ’
Public announcement logic is an extension of multi-agent epistemic logic with dynamic operators to model the informational consequences of announcements to the entire group of agents. We propose an extension of public announcement logic with a dynamic modal operator that expresses what is true after any announcement: ♦φ expresses that there is a truthful announcement ψ after which φ is true. Th...
متن کاملAnnouncement Wars as an Equilibrium Selection Device
This paper attempts to give a rationale to public announcements, so often observed in the real world, and to formalize the idea that they can be used as a form of equilibrium selection device when multiple equilibria arise. It also shows how announcements solve the problems of coordination failures as predicted by the empirical literature based on experimental studies.
متن کاملEverything is Knowable – How to Get to Know
Fitch showed that not every true proposition can be known in due time; in other words, that not every proposition is knowable. Moore showed that certain propositions cannot be consistently believed. A more recent dynamic phrasing of Moore-sentences is that not all propositions are known after their announcement, i.e., not every proposition is successful. Fitch’s and Moore’s results are related,...
متن کاملEverything is Knowable — how to get to know whether a proposition is true
Fitch showed that not every true proposition can be known in due time; in other words, that not every proposition is knowable. Moore showed that certain propositions cannot be consistently believed. A more recent dynamic phrasing of Moore-sentences is that not all propositions are known after their announcement, i.e. not every proposition is successful. Fitch’s and Moore’s results are related, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Review of Symbolic Logic
سال: 2008
ISSN: 1755-0203,1755-0211
DOI: 10.1017/s1755020308080210